Multi-Agent Meta-Reinforcement Learning for Self-Powered and Sustainable Edge Computing Systems

نویسندگان

چکیده

The stringent requirements of mobile edge computing (MEC) applications and functions fathom the high capacity dense deployment MEC hosts to upcoming wireless networks. However, operating such can significantly increase energy consumption. Thus, a base station (BS) unit act as self-powered BS. In this article, an effective dispatch mechanism for networks with capabilities is studied. First, two-stage linear stochastic programming problem formulated goal minimizing total consumption cost system while fulfilling demand. Second, semi-distributed data-driven solution proposed by developing novel multi-agent meta-reinforcement learning (MAMRL) framework solve problem. particular, each BS plays role local agent that explores Markovian behavior both generation transfers time-varying features meta-agent. Sequentially, meta-agent optimizes (i.e., exploits) decision accepting only observations from its own state information. Meanwhile, estimates policy applying learned parameters Finally, MAMRL benchmarked analyzing deterministic, asymmetric, environments in terms non-renewable usages, cost, accuracy. Experimental results show model reduce up 11% usage 22.4% (with 95.8% prediction accuracy), compared other baseline methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Morphogenetic Computing and Reinforcement Learning for Multi-agent Systems

There are some major limitations to conventional rule-based approaches for multi-robot system applications. First, as the complexity and scale of swarm robots grow, most rule-based methods are not able to accomplish the tasks due to the extensive communication and computational loads. Second, in most of the rule-based control systems, certain properties of the systems are predefined by the desi...

متن کامل

Reinforcement learning for multi-agent systems

Multi-agent systems are rapidly finding applications in a variety of domains, including robotics, distributed control, telecommunications, etc. Although the individual agents can be programmed in advance, many tasks require that they learn behaviors online. A significant part of the research on multi-agent learning concerns reinforcement learning techniques. This paper gives a survey of multiag...

متن کامل

Reinforcement Learning in Cooperative Multi–Agent Systems

Reinforcement Learning is used in cooperative multi–agent systems differently for various problems. We provide a review on learning algorithms used for repeated common–payoff games, and stochastic general– sum games. Then these learning algorithms is compared with another algorithm for the credit assignment problem that attempts to correctly assign agents the awards that they deserve.

متن کامل

Reinforcement Learning in Large Multi-agent Systems

Enabling reinforcement learning to be effective in large-scale multi-agent Markov Decisions Problems is a challenging task. To address this problem we propose a multi-agent variant of Q-learning: “Q Updates with Immediate Counterfactual Rewards-learning” (QUICR-learning). Given a global reward function over all agents that the large-scale system is trying to maximize, QUICR-learning breaks down...

متن کامل

Meta-game Equilibrium for Multi-agent Reinforcement Learning

This paper proposes a multi-agent Q-learning algorithm called meta-game-Q learning that is developed from the meta-game equilibrium concept. Different from Nash equilibrium, meta-game equilibrium can achieve the optimal joint action game through deliberating its preference and predicting others’ policies in the general-sum game. A distributed negotiation algorithm is used to solve the meta-game...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Network and Service Management

سال: 2021

ISSN: ['2373-7379', '1932-4537']

DOI: https://doi.org/10.1109/tnsm.2021.3057960